Varieties Whose Tolerances Are Homomorphic Images of Their Congruences
نویسنده
چکیده
The homomorphic image of a congruence is always a tolerance (relation) but, within a given variety, a tolerance is not necessarily obtained this way. By a Maltsev-like condition, we characterize varieties whose tolerances are homomorphic images of their congruences (TImC). As corollaries, we prove that the variety of semilattices, all varieties of lattices, and all varieties of unary algebras have TImC. We show that a congruence n-permutable variety has TImC if and only if it is congruence permutable, and construct an idempotent variety with a majority term that fails TImC.
منابع مشابه
Factorable Congruences and Strict Refinement
We show that universal algebras with factorable congruences such as rings with 1 and semirings with 0 and 1 enjoy some of the properties of universal algebras whose congruence lattices are distributive, such as the strict refinement property and a variant of Jónsson’s lemma. A universal algebra A is said to have factorable congruences if whenever A ∼= B × C and θ is a congruence on A, then θ = ...
متن کاملPermutability of Tolerances with Factor and Decomposing Congruences
A variety V has tolerances permutable with factor congruences if for any A1, A2 of V and every tolerance T on A1 × A2 we have T ◦ Π1 = Π1 ◦ T and T ◦ Π2 = Π2 ◦ T , where Π1,Π2 are factor congruences. If B is a subalgebra of A1×A2, the congruences Θi = Πi∩B are called decomposing congruences. V has tolerances permutable with decomposing congruences if T ◦ Θi = Θi ◦ T (i = 1, 2) for each A1, A2 ∈...
متن کاملComputably Enumerable Algebras, Their Expansions, and Isomorphisms
Computably enumerable algebras are the ones whose positive atomic diagrams are computably enumerable. Computable algebras are the ones whose atomic diagrams are computable. In this paper we investigate computably enumerable algebras and provide several algebraic and computable theoretic distinctions of these algebras from the class of computable algebras. We give a characterization of computabl...
متن کاملQuasi-Varieties, Congruences, and Generalized Dowling Lattices
Dowling lattices and their generalizations introduced by Hanlon are interpreted as lattices of congruences associated to certain quasi-varieties of sets with group actions. This interpretation leads, by a simple application of Mobius inversion, to polynomial identities which specialize to Hanlon's evaluation of the characteristic polynomials of generalized Dowling lattices. Analogous results ar...
متن کاملOn varieties of semigroups and unary algebras∗†
The elementary result of Variety theory is Eilenberg’s Variety theorem which was motivated by characterizations of several families of string languages by syntactic monoids or semigroups, such as Schützenberger’s theorem connecting star-free languages and aperiodic monoids. Eilenberg’s theorem has been extended in various directions. For example, Thérien involved varieties of congruences on fre...
متن کامل